Fault Tolerant Data Structures - Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on
نویسندگان
چکیده
We consider the tolerance of data structures to memory faults. We observe that many pointer-based data structures (e.g. linked lists, trees, etc.) are highly nonresilient to faults. A single fault in a linked list or tree may result in the loss of the entire set of data. In this paper we present a formal framework for studying the fault tolerance properties of pointer-based data structures, and we provide fault tolerant versions of the stack, the linked list, and the dictionary tree.
منابع مشابه
Approximate Strip Packing - Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on
We present an qpproximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm find,!; a packing of n rectangles whose total height is within a ,factor of (1 + E ) of optimal, and has running time polynomial both in n and in 1 / E . It is based on a reduction to fractional bin-packing, and ...
متن کاملDecoherence and programmable quantum computation
When coherent states of the electromagnetic field are used to drive the evolution of a quantum computer, a decoherence results due to the back reaction from the qubits onto the fields. We show how to calculate this effect. No assumptions about the environment are necessary, so this represents a useful model to test the fidelity of quantum error correcting codes. We examine two cases of interest...
متن کاملFault-tolerant Wait-free Shared Objects *t
A concurrent system consists of processes and shared objects. Previous research focused on the problem of tolerating process failures. We study the complementary problem of tolerating object failures. We divide object failures into two broad classes: responsive and non-responsive. With responsive failures, a faulty object responds to every invocation, but responses may be incorrect. With non-re...
متن کاملCommunication-optimal maintenance of replicated information - Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
متن کامل
Finding separator cuts in planar graphs within twice the optimal
A factor 2 approximation algorithm for the problem of finding a minimum-cost bbalanced cut in planar graphs is presented, for b ≤ 1 3 . We assume that the vertex weights are given in unary; for the case of binary vertex weights, a pseudoapproximation algorithm is presented. This problem is of considerable practical significance, especially in VLSI design. The natural algorithm for this problem ...
متن کامل